0.07/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.31 % Computer : n026.cluster.edu 0.12/0.31 % Model : x86_64 x86_64 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.31 % Memory : 8042.1875MB 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.31 % CPULimit : 1200 0.12/0.31 % WCLimit : 120 0.12/0.31 % DateTime : Tue Jul 13 15:37:44 EDT 2021 0.12/0.31 % CPUTime : 0.12/0.31 % Number of cores: 8 0.12/0.32 % Python version: Python 3.6.8 0.12/0.32 # Version: 2.6rc1-ho 0.12/0.32 # No SInE strategy applied 0.12/0.32 # Trying AutoSched0 for 59 seconds 0.12/0.35 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. 0.12/0.35 # 0.12/0.35 # Preprocessing time : 0.030 s 0.12/0.35 # Presaturation interreduction done 0.12/0.35 0.12/0.35 # Proof found! 0.12/0.35 # SZS status Theorem 0.12/0.35 # SZS output start CNFRefutation 0.12/0.35 thf(mand, axiom, (mand)=(^[X6:$i > $o, X7:$i > $o, X26:$i]:~((~(X6 @ X26)|~(X7 @ X26)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mand)). 0.12/0.35 thf(mnot, axiom, (mnot)=(^[X6:$i > $o, X3:$i]:~(X6 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)). 0.12/0.35 thf(mor, axiom, (mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(X6 @ X3|X7 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)). 0.12/0.35 thf(mimplies, axiom, (mimplies)=(^[X6:$i > $o, X7:$i > $o, X29:$i]:(~(X6 @ X29)|X7 @ X29)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.12/0.35 thf(conj, conjecture, ![X13:$i > $i > $o]:(mvalid @ (mforall_prop @ (^[X18:$i > $o]:mforall_prop @ (^[X19:$i > $o]:mor @ (mbox @ X13 @ (mimplies @ (mand @ X18 @ (mbox @ X13 @ X18)) @ X19)) @ (mbox @ X13 @ (mimplies @ (mand @ X19 @ (mbox @ X13 @ X19)) @ X18)))))<=mweakly_connected @ X13), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)). 0.12/0.35 thf(mforall_prop, axiom, (mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:![X10:$i > $o]:X9 @ X10 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mforall_prop)). 0.12/0.35 thf(mbox, axiom, (mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:![X14:$i]:(~(X13 @ X3 @ X14)|X6 @ X14)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mbox)). 0.12/0.35 thf(mweakly_connected, axiom, (mweakly_connected)=(^[X13:$i > $i > $o]:![X15:$i, X16:$i, X17:$i]:((X13 @ X15 @ X16&X13 @ X15 @ X17)=>((X13 @ X16 @ X17|(X16)=(X17))|X13 @ X17 @ X16))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mweakly_connected)). 0.12/0.35 thf(mvalid, axiom, (mvalid)=(^[X6:$i > $o]:![X3:$i]:X6 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.12/0.35 thf(c_0_9, axiom, (mand)=(^[X6:$i > $o, X7:$i > $o, X26:$i]:~((~(X6 @ X26)|~(X7 @ X26)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mand, mnot]), mor])). 0.12/0.35 thf(c_0_10, axiom, (mimplies)=(^[X6:$i > $o, X7:$i > $o, X29:$i]:(~(X6 @ X29)|X7 @ X29)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mimplies, mnot]), mor])). 0.12/0.35 thf(c_0_11, negated_conjecture, ~(![X13:$i > $i > $o]:(![X148:$i, X149:$i, X150:$i]:((X13 @ X148 @ X149&X13 @ X148 @ X150)=>(X13 @ X149 @ X150|(X149)=(X150)|X13 @ X150 @ X149))=>![X134:$i, X142:$i > $o, X143:$i > $o]:(![X144:$i]:(~X13 @ X134 @ X144|(~(~((~X142 @ X144|~(![X145:$i]:(~X13 @ X144 @ X145|X142 @ X145)))))|X143 @ X144))|![X146:$i]:(~X13 @ X134 @ X146|(~(~((~X143 @ X146|~(![X147:$i]:(~X13 @ X146 @ X147|X143 @ X147)))))|X142 @ X146))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), mor]), c_0_9]), c_0_10]), mforall_prop]), mbox]), mweakly_connected]), mvalid])])). 0.12/0.35 thf(c_0_12, negated_conjecture, ![X152:$i, X153:$i, X154:$i, X159:$i, X161:$i]:((~epred1_0 @ X152 @ X153|~epred1_0 @ X152 @ X154|(epred1_0 @ X153 @ X154|(X153)=(X154)|epred1_0 @ X154 @ X153))&((epred1_0 @ esk1_0 @ esk2_0&((epred2_0 @ esk2_0&(~epred1_0 @ esk2_0 @ X159|epred2_0 @ X159))&~epred3_0 @ esk2_0))&(epred1_0 @ esk1_0 @ esk3_0&((epred3_0 @ esk3_0&(~epred1_0 @ esk3_0 @ X161|epred3_0 @ X161))&~epred2_0 @ esk3_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.12/0.35 thf(c_0_13, negated_conjecture, ![X14:$i, X3:$i, X15:$i]:(epred1_0 @ X14 @ X15|(X14)=(X15)|epred1_0 @ X15 @ X14|~epred1_0 @ X3 @ X14|~epred1_0 @ X3 @ X15), inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_14, negated_conjecture, epred1_0 @ esk1_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_15, negated_conjecture, ![X3:$i]:((X3)=(esk3_0)|epred1_0 @ X3 @ esk3_0|epred1_0 @ esk3_0 @ X3|~epred1_0 @ esk1_0 @ X3), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.12/0.35 thf(c_0_16, negated_conjecture, epred1_0 @ esk1_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_17, negated_conjecture, ![X3:$i]:(epred2_0 @ X3|~epred1_0 @ esk2_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_18, negated_conjecture, ((esk2_0)=(esk3_0)|epred1_0 @ esk3_0 @ esk2_0|epred1_0 @ esk2_0 @ esk3_0), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.12/0.35 thf(c_0_19, negated_conjecture, ~epred2_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_20, negated_conjecture, ![X3:$i]:(epred3_0 @ X3|~epred1_0 @ esk3_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_21, negated_conjecture, ((esk2_0)=(esk3_0)|epred1_0 @ esk3_0 @ esk2_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])). 0.12/0.35 thf(c_0_22, negated_conjecture, ~epred3_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_23, negated_conjecture, (esk2_0)=(esk3_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])). 0.12/0.35 thf(c_0_24, negated_conjecture, epred3_0 @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.35 thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']). 0.12/0.35 # SZS output end CNFRefutation 0.12/0.35 # Proof object total steps : 26 0.12/0.35 # Proof object clause steps : 13 0.12/0.35 # Proof object formula steps : 13 0.12/0.35 # Proof object conjectures : 16 0.12/0.35 # Proof object clause conjectures : 13 0.12/0.35 # Proof object formula conjectures : 3 0.12/0.35 # Proof object initial clauses used : 8 0.12/0.35 # Proof object initial formulas used : 9 0.12/0.35 # Proof object generating inferences : 4 0.12/0.35 # Proof object simplifying inferences : 5 0.12/0.35 # Training examples: 0 positive, 0 negative 0.12/0.35 # Parsed axioms : 64 0.12/0.35 # Removed by relevancy pruning/SinE : 0 0.12/0.35 # Initial clauses : 41 0.12/0.35 # Removed in clause preprocessing : 32 0.12/0.35 # Initial clauses in saturation : 9 0.12/0.35 # Processed clauses : 23 0.12/0.35 # ...of these trivial : 0 0.12/0.35 # ...subsumed : 0 0.12/0.35 # ...remaining for further processing : 23 0.12/0.35 # Other redundant clauses eliminated : 0 0.12/0.35 # Clauses deleted for lack of memory : 0 0.12/0.35 # Backward-subsumed : 1 0.12/0.35 # Backward-rewritten : 6 0.12/0.35 # Generated clauses : 8 0.12/0.35 # ...of the previous two non-trivial : 9 0.12/0.35 # Contextual simplify-reflections : 0 0.12/0.35 # Paramodulations : 8 0.12/0.35 # Factorizations : 0 0.12/0.35 # NegExts : 0 0.12/0.35 # Equation resolutions : 0 0.12/0.35 # Propositional unsat checks : 0 0.12/0.35 # Propositional check models : 0 0.12/0.35 # Propositional check unsatisfiable : 0 0.12/0.35 # Propositional clauses : 0 0.12/0.35 # Propositional clauses after purity: 0 0.12/0.35 # Propositional unsat core size : 0 0.12/0.35 # Propositional preprocessing time : 0.000 0.12/0.35 # Propositional encoding time : 0.000 0.12/0.35 # Propositional solver time : 0.000 0.12/0.35 # Success case prop preproc time : 0.000 0.12/0.35 # Success case prop encoding time : 0.000 0.12/0.35 # Success case prop solver time : 0.000 0.12/0.35 # Current number of processed clauses : 7 0.12/0.35 # Positive orientable unit clauses : 3 0.12/0.35 # Positive unorientable unit clauses: 0 0.12/0.35 # Negative unit clauses : 1 0.12/0.35 # Non-unit-clauses : 3 0.12/0.35 # Current number of unprocessed clauses: 3 0.12/0.35 # ...number of literals in the above : 14 0.12/0.35 # Current number of archived formulas : 0 0.12/0.35 # Current number of archived clauses : 16 0.12/0.35 # Clause-clause subsumption calls (NU) : 1 0.12/0.35 # Rec. Clause-clause subsumption calls : 1 0.12/0.35 # Non-unit clause-clause subsumptions : 1 0.12/0.35 # Unit Clause-clause subsumption calls : 0 0.12/0.35 # Rewrite failures with RHS unbound : 0 0.12/0.35 # BW rewrite match attempts : 1 0.12/0.35 # BW rewrite match successes : 1 0.12/0.35 # Condensation attempts : 0 0.12/0.35 # Condensation successes : 0 0.12/0.35 # Termbank termtop insertions : 3330 0.12/0.35 0.12/0.35 # ------------------------------------------------- 0.12/0.35 # User time : 0.029 s 0.12/0.35 # System time : 0.006 s 0.12/0.35 # Total time : 0.036 s 0.12/0.35 # Maximum resident set size: 1720 pages 0.12/0.35 EOF